Aggregate nearest neighbor queries in spatial databases
نویسندگان
چکیده
منابع مشابه
Continuous aggregate nearest neighbor queries
This paper addresses the problem of continuous aggregate nearestneighbor (CANN) queries for moving objects in spatio-temporal data stream management systems. A CANN query specifies a set of landmarks, an integer k, and an aggregate distance function f (e.g., min, max, or sum), where f computes the aggregate distance between a moving object and each of the landmarks. The answer to this continuou...
متن کاملK-Nearest Neighbor Temporal Aggregate Queries
We study a new type of queries called the k-nearest neighbor temporal aggregate (kNNTA) query. Given a query point and a time interval, it returns the top-k locations that have the smallest weighted sums of (i) the spatial distance to the query point and (ii) a temporal aggregate on a certain attribute over the time interval. For example, find a nearby club that has the largest number of people...
متن کاملReverse Nearest Neighbor Queries for Dynamic Databases
In this paper we propose an algorithm for answering reverse nearest neighbor (RNN) queries, a problem formulated only recently. This class of queries is strongly related to that of nearest neighbor (NN) queries, although the two are not necessarily complementary. Unlike nearest neighbor queries, RNN queries nd the set of database points that have the query point as the nearest neighbor. There i...
متن کاملThe Spatial Nearest Neighbor Skyline Queries
User preference queries are very important in spatial databases. With the help of these queries, one can found best location among points saved in database. In many situation users evaluate quality of a location with its distance from its nearest neighbor among a special set of points. There has been less attention about evaluating a location with its distance to nearest neighbors in spatial us...
متن کاملAlternative Solutions for Continuous K Nearest Neighbor Queries in Spatial Network Databases
Continuous K nearest neighbor queries (C-KNN) are defined as finding the nearest points of interest along an entire path (e.g., finding the three nearest gas stations to a moving car on any point of a pre-specified path). The result of this type of query is a set of intervals (or split points) and their corresponding KNNs, such that the KNNs of all points within each interval are the same. The ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Database Systems
سال: 2005
ISSN: 0362-5915,1557-4644
DOI: 10.1145/1071610.1071616